Recognizability of Redexes for Higher-Order Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Recognizability of Redexes for Higher-Order Rewrite Systems
It is known that the set of all redexes for a left-linear term rewriting system is recognizable by a tree automaton, which means that we can construct a tree automaton that accepts redexes. The present paper extends this result to Nipkow’s higher-order rewrite systems, in which every left-hand side is a linear fully-extended pattern. A naive extension of the first-order method causes the automa...
متن کاملTermination Proofs for Higher-order Rewrite Systems
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [12]. This formalism combines the computational aspects of term rewriting and simply typed lambda calculus. The result is a proof technique for the termination of a HRS, similar to the proof technique \Termination by interpretation in a wellfounded monotone algebra", described in [8, 19]. The resulti...
متن کاملProving Termination of Higher-order Rewrite Systems
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip9l, Nip93]. This formalism combines the computational aspects of term rewriting and simply typed lambda calculus. Our result is a proof technique for the termination of a HRS, similar to the proof technique "Termination by interpretation in a well-founded monotone algebra" described in [Zan93]. T...
متن کاملOrthogonal Higher-Order Rewrite Systems are Confluent
Two important aspects of computation are reduction, hence the current infatuation with termrewriting systems (TI~Ss), and abstraction, hence the study of A-calculus. In his groundbreaking thesis, Klop [10] combined both areas in the framework of combinatory reduction systems (ClaSs) and lifted many results from the A-calculus to the CRS-level. More recently [15], we proposed a different althoug...
متن کاملHigher-order Rewrite Systems and Their Connuence
We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to-terms. HRSs can describe computations over terms with bound variables. We show that rewriting with HRSs is closely related to undirected equational reasoning. We deene Pattern Rewrite Systems (PRSs) as a special case of HRSs and extend three connuence results from term rewriting to PRSs: the critical pair lemma by Knuth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Online Transactions
سال: 2009
ISSN: 1882-6660
DOI: 10.2197/ipsjtrans.2.71